Nonlinear Control Synthesis by Convex Optimization
نویسندگان
چکیده
منابع مشابه
Control Synthesis of Systems with Uncertain Parameters by Convex Optimization
The last few years witnessed an increasing interest in the problem of control synthesis of nonlinear systems. A recently derived stability criterion for nonlinear systems –which has a remarkable convexity property– and the development of numerical methods for verification of positivity allows the computation –via semidefinite programming– of stabilizing controllers for the case of systems with ...
متن کاملCapacity Control via Convex Optimization
Capacity control is a very important problem in civil infrastructure operation, but no general model exists for it. In this project we • Formulate the real-time capacity control problem of a single facility • Perform dynamic programming to search for the optimal solution • Implement piecewise linear regression to update the objective function, and SCP to update the policy • Extend the model to ...
متن کاملAntenna array pattern synthesis via convex optimization
We show that a variety of antenna array pattern synthesis problems can be expressed as convex optimization problems, which can be (numerically) solved with great eeciency by recently developed interior-point methods. The synthesis problems involve arrays with arbitrary geometry and element directivity, constraints on far and near eld patterns over narrow or broad frequency bandwidth, and some i...
متن کاملGain-Scheduling Control With Dynamic Multipliers by Convex Optimization
In this paper we provide a solution to the gain-scheduling synthesis problem (GSP) for structured parametric and dynamic passive uncertainties, which encompasses an approach for norm-bounded uncertainties as considered in classical structured singular value theory. If compared to known approaches, the distinguishing feature is the use of frequency-dependent multipliers to guarantee stability an...
متن کاملControl Applications of Nonlinear Convex Programming
Since 1984 there has been a concentrated e ort to develop e cient interior-point methods for linear programming (LP). In the last few years researchers have begun to appreciate a very important property of these interior-point methods (beyond their e ciency for LP): they extend gracefully to nonlinear convex optimization problems. New interior-point algorithms for problem classes such as semide...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2004
ISSN: 0018-9286
DOI: 10.1109/tac.2003.823000